#include <iostream>
#include <vector>
using namespace std;

class Solution
{
public:
    int uniquePaths(int m, int n)
    {
        vector<int> dp(n, 0);
        dp[0] = 1;
        for (int l = 0; l < m; l++)
        {
            for (int i = 1; i < n; i++)
            {
                dp[i] = dp[i - 1] + dp[i];
            }
        }
        return dp[n - 1];
    }
};
int main()
{
    cout << "Code62" << endl;
    Solution s;
    return 0;
}